Crash-Proof Syntax
نویسنده
چکیده
The Minimalist Program is guided by the idea that the syntactic system of the language faculty is designed to optimally meet design specifications imposed by the interface systems. In this paper we argue that an optimal derivational system, at least from a computational point of view, is a system that generates only objects that are well-formed and satisfy conditions imposed by the interface systems. We explore the feasibility of constructing such a system, one in which there is no notion of “crashing derivations”. We also argue that both the interface conditions and the derivational system which is designed to satisfy them are real, and in this sense we expect to find a pervasive redundancy in linguistic explanation. By demanding that the derivational system be crash-proof, without filters imposed on its end products, we hope to help draw the boundary between the derivational system and the interface conditions, and to make progress in understanding both.
منابع مشابه
Revisiting the Evaluator : Derivations ( and Learning ) in OT
This theoretical, programmatic paper has as its purpose to open new perspectives for a crash-proof version of Optimality Theory, in which the GEN function only produces an optimal candidate per derivational cycle. We will discuss the concept of crash-proof syntax (Putman, 2010), trying to incorporate it into a learning model for neural networks, briefly getting into the digital computers-quantu...
متن کاملBuilding a file system with FSCQ infrastructure
FSCQ is a file system with a machine-checkable proof (using the Coq proof assistant [2]) that its implementation meets its specification, even under crashes. FSCQ provably avoids bugs that have plagued previous file systems, such as performing disk writes without sufficient barriers or forgetting to zero out directory blocks. FSCQ built upon the Crash Hoare Logic (CHL) infrastructure. FSCQ uses...
متن کاملFormal Specification and Automatic Verification
Real-time systems need to react to certain input stimuli within given time bounds. For example, an airbag in a car has to unfold within 300 milliseconds in a crash. There are many embedded safety-critical applications and each requires real-time specification techniques. This textbook introduces three of these techniques, based on logic and automata: Duration Calculus, Timed Automata, and PLC-A...
متن کاملSyntax for Free: Representing Syntax with Binding Using Parametricity
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed de Bruijn terms. That is, the type of closed higher-order abstract syntax terms is isomorphic to a concrete representation. To demonstrate the proof we have constructed a model of parametric polymorphism inside the Coq proof assistant. The proof of the theorem requires parame...
متن کاملProof Diagrams for Multiplicative Linear Logic: Syntax and Semantics
Proof nets are a syntax for linear logic proofs which gives a coarser notion of proof equivalence with respect to syntactic equality together with an intuitive geometrical representation of proofs. In this paper we give an alternative 2-dimensional syntax for multiplicative linear logic derivations. The syntax of string diagrams authorizes the definition of a framework where the sequentializabi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000